0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.34	% Computer : n024.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1920
0.12/0.34	% WCLimit    : 240
0.12/0.34	% DateTime   : Wed Jul 30 02:00:19 EDT 2025
0.12/0.34	% CPUTime    : 
0.20/0.49	Running higher-order theorem proving
0.20/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.KnFlKXywg6/E---3.1_9981.p
0.20/0.51	# Version: 3.0.0-ho
0.20/0.51	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting new_ho_10 with 1200s (5) cores
0.20/0.51	# Starting ho_unfolding_6 with 240s (1) cores
0.20/0.51	# Starting sh4l with 240s (1) cores
0.20/0.51	# Starting ehoh_best_nonlift_rwall with 240s (1) cores
0.20/0.51	# new_ho_10 with pid 10059 completed with status 0
0.20/0.51	# Result found by new_ho_10
0.20/0.51	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting new_ho_10 with 1200s (5) cores
0.20/0.51	# No SInE strategy applied
0.20/0.51	# Search class: HGUNF-FFSF00-SFFFFFNN
0.20/0.51	# Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.51	# Starting new_ho_10 with 721s (1) cores
0.20/0.51	# Starting sh5l with 121s (1) cores
0.20/0.51	# Starting new_bool_1 with 121s (1) cores
0.20/0.51	# Starting new_bool_2 with 121s (1) cores
0.20/0.51	# Starting new_bool_9 with 116s (1) cores
0.20/0.51	# new_bool_1 with pid 10068 completed with status 0
0.20/0.51	# Result found by new_bool_1
0.20/0.51	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting new_ho_10 with 1200s (5) cores
0.20/0.51	# No SInE strategy applied
0.20/0.51	# Search class: HGUNF-FFSF00-SFFFFFNN
0.20/0.51	# Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.51	# Starting new_ho_10 with 721s (1) cores
0.20/0.51	# Starting sh5l with 121s (1) cores
0.20/0.51	# Starting new_bool_1 with 121s (1) cores
0.20/0.51	# Preprocessing time       : 0.001 s
0.20/0.51	# Presaturation interreduction done
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	thf(decl_23, type, cQ: $i > $i > $o).
0.20/0.51	thf(decl_24, type, cP: $i > $i > $o).
0.20/0.51	thf(decl_25, type, epred1_0: $o).
0.20/0.51	thf(decl_26, type, esk1_0: $i).
0.20/0.51	thf(decl_27, type, esk2_0: $i).
0.20/0.51	thf(decl_28, type, esk3_0: $i).
0.20/0.51	thf(decl_29, type, esk4_0: $i).
0.20/0.51	thf(cCADE13_pme, conjecture, ((![X1:$i, X2:$i]:((cQ @ X1 @ X2))|![X1:$i, X2:$i]:((cP @ X1 @ X2)))<=(((![X1:$i, X2:$i, X3:$i]:((((cP @ X1 @ X2)&(cP @ X2 @ X3))=>(cP @ X1 @ X3)))&![X1:$i, X2:$i, X3:$i]:((((cQ @ X1 @ X2)&(cQ @ X2 @ X3))=>(cQ @ X1 @ X3))))&![X1:$i, X2:$i]:(((cQ @ X1 @ X2)=>(cQ @ X2 @ X1))))&![X1:$i, X2:$i]:(((cQ @ X1 @ X2)|(cP @ X1 @ X2))))), file('/export/starexec/sandbox/tmp/tmp.KnFlKXywg6/E---3.1_9981.p', cCADE13_pme)).
0.20/0.51	thf(c_0_1, plain, ((epred1_0)<=>(((![X1:$i, X2:$i, X3:$i]:((((cP @ X1 @ X2)&(cP @ X2 @ X3))=>(cP @ X1 @ X3)))&![X1:$i, X2:$i, X3:$i]:((((cQ @ X1 @ X2)&(cQ @ X2 @ X3))=>(cQ @ X1 @ X3))))&![X1:$i, X2:$i]:(((cQ @ X1 @ X2)=>(cQ @ X2 @ X1))))&![X1:$i, X2:$i]:(((cQ @ X1 @ X2)|(cP @ X1 @ X2))))), introduced(definition)).
0.20/0.51	thf(c_0_2, plain, ((epred1_0)=>(((![X1:$i, X2:$i, X3:$i]:((((cP @ X1 @ X2)&(cP @ X2 @ X3))=>(cP @ X1 @ X3)))&![X1:$i, X2:$i, X3:$i]:((((cQ @ X1 @ X2)&(cQ @ X2 @ X3))=>(cQ @ X1 @ X3))))&![X1:$i, X2:$i]:(((cQ @ X1 @ X2)=>(cQ @ X2 @ X1))))&![X1:$i, X2:$i]:(((cQ @ X1 @ X2)|(cP @ X1 @ X2))))), inference(split_equiv,[status(thm)],[c_0_1])).
0.20/0.51	thf(c_0_3, negated_conjecture, ~(((epred1_0)=>(![X1:$i, X2:$i]:((cQ @ X1 @ X2))|![X1:$i, X2:$i]:((cP @ X1 @ X2))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cCADE13_pme])]), c_0_1])).
0.20/0.51	thf(c_0_4, plain, ![X22:$i, X23:$i, X24:$i, X25:$i, X26:$i, X27:$i, X28:$i, X29:$i, X30:$i, X31:$i]:(((((~(cP @ X22 @ X23)|~(cP @ X23 @ X24)|(cP @ X22 @ X24)|~(epred1_0))&(~(cQ @ X25 @ X26)|~(cQ @ X26 @ X27)|(cQ @ X25 @ X27)|~(epred1_0)))&(~(cQ @ X28 @ X29)|(cQ @ X29 @ X28)|~(epred1_0)))&((cQ @ X30 @ X31)|(cP @ X30 @ X31)|~(epred1_0)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])).
0.20/0.51	thf(c_0_5, negated_conjecture, ((epred1_0)&(~(cQ @ esk1_0 @ esk2_0)&~(cP @ esk3_0 @ esk4_0))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])).
0.20/0.51	thf(c_0_6, plain, ![X1:$i, X2:$i, X3:$i]:(((cP @ X1 @ X3)|~((cP @ X1 @ X2))|~((cP @ X2 @ X3))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.51	thf(c_0_7, negated_conjecture, (epred1_0), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.51	thf(c_0_8, plain, ![X1:$i, X2:$i]:(((cQ @ X1 @ X2)|(cP @ X1 @ X2)|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.51	thf(c_0_9, plain, ![X1:$i, X2:$i, X3:$i]:(((cP @ X1 @ X2)|~((cP @ X3 @ X2))|~((cP @ X1 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7])])).
0.20/0.51	thf(c_0_10, plain, ![X1:$i, X2:$i]:(((cP @ X1 @ X2)|(cQ @ X1 @ X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_7])])).
0.20/0.51	thf(c_0_11, plain, ![X1:$i, X2:$i]:(((cQ @ X2 @ X1)|~((cQ @ X1 @ X2))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.51	thf(c_0_12, negated_conjecture, ~((cP @ esk3_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.51	thf(c_0_13, plain, ![X3:$i, X2:$i, X1:$i]:(((cQ @ X1 @ X2)|(cP @ X3 @ X2)|~((cP @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.20/0.51	thf(c_0_14, plain, ![X1:$i, X2:$i, X3:$i]:(((cQ @ X1 @ X3)|~((cQ @ X1 @ X2))|~((cQ @ X2 @ X3))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.20/0.51	thf(c_0_15, plain, ![X2:$i, X1:$i]:(((cQ @ X1 @ X2)|~((cQ @ X2 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_7])])).
0.20/0.51	thf(c_0_16, negated_conjecture, (cQ @ esk3_0 @ esk4_0), inference(spm,[status(thm)],[c_0_12, c_0_10])).
0.20/0.51	thf(c_0_17, plain, ![X1:$i, X2:$i, X3:$i]:(((cQ @ X1 @ X2)|(cP @ X1 @ X3)|(cQ @ X2 @ X3))), inference(spm,[status(thm)],[c_0_13, c_0_10])).
0.20/0.51	thf(c_0_18, plain, ![X1:$i, X2:$i, X3:$i]:(((cQ @ X1 @ X2)|~((cQ @ X3 @ X2))|~((cQ @ X1 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_7])])).
0.20/0.51	thf(c_0_19, plain, (cQ @ esk4_0 @ esk3_0), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.20/0.51	thf(c_0_20, negated_conjecture, ![X1:$i]:(((cQ @ X1 @ esk4_0)|(cQ @ esk3_0 @ X1))), inference(spm,[status(thm)],[c_0_12, c_0_17])).
0.20/0.51	thf(c_0_21, plain, ![X1:$i]:(((cQ @ X1 @ esk3_0)|~((cQ @ X1 @ esk4_0)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.51	thf(c_0_22, plain, ![X1:$i]:((cQ @ X1 @ esk3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_20]), c_0_21])).
0.20/0.51	thf(c_0_23, plain, ![X1:$i]:((cQ @ esk3_0 @ X1)), inference(spm,[status(thm)],[c_0_15, c_0_22])).
0.20/0.51	thf(c_0_24, negated_conjecture, ~((cQ @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.20/0.51	thf(c_0_25, plain, ![X1:$i, X2:$i]:((cQ @ X1 @ X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_23]), c_0_22])])).
0.20/0.51	thf(c_0_26, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_25])]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Parsed axioms                        : 3
0.20/0.51	# Removed by relevancy pruning/SinE    : 0
0.20/0.51	# Initial clauses                      : 9
0.20/0.51	# Removed in clause preprocessing      : 2
0.20/0.51	# Initial clauses in saturation        : 7
0.20/0.51	# Processed clauses                    : 29
0.20/0.51	# ...of these trivial                  : 0
0.20/0.51	# ...subsumed                          : 0
0.20/0.51	# ...remaining for further processing  : 29
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 3
0.20/0.51	# Backward-rewritten                   : 15
0.20/0.51	# Generated clauses                    : 46
0.20/0.51	# ...of the previous two non-redundant : 35
0.20/0.51	# ...aggressively subsumed             : 0
0.20/0.51	# Contextual simplify-reflections      : 1
0.20/0.51	# Paramodulations                      : 44
0.20/0.51	# Factorizations                       : 2
0.20/0.51	# NegExts                              : 0
0.20/0.51	# Equation resolutions                 : 0
0.20/0.51	# Disequality decompositions           : 0
0.20/0.51	# Total rewrite steps                  : 33
0.20/0.51	# ...of those cached                   : 10
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 4
0.20/0.51	#    Positive orientable unit clauses  : 2
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 1
0.20/0.51	#    Non-unit-clauses                  : 1
0.20/0.51	# Current number of unprocessed clauses: 18
0.20/0.51	# ...number of literals in the above   : 56
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 25
0.20/0.51	# Clause-clause subsumption calls (NU) : 30
0.20/0.51	# Rec. Clause-clause subsumption calls : 29
0.20/0.51	# Non-unit clause-clause subsumptions  : 1
0.20/0.51	# Unit Clause-clause subsumption calls : 37
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 16
0.20/0.51	# BW rewrite match successes           : 16
0.20/0.51	# Condensation attempts                : 0
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 1845
0.20/0.51	# Search garbage collected termcells   : 193
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.005 s
0.20/0.51	# System time              : 0.003 s
0.20/0.51	# Total time               : 0.008 s
0.20/0.51	# Maximum resident set size: 1832 pages
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.017 s
0.20/0.51	# System time              : 0.008 s
0.20/0.51	# Total time               : 0.025 s
0.20/0.51	# Maximum resident set size: 1708 pages
0.20/0.51	% E exiting
0.20/0.51	% E exiting
0.20/0.51	EOF